famili dissimilar measur node gener shortest path commut time distanc luh yen marco saeren amin mantrach masashi shimbo work introduc famili link base dissimilar measur node weight direct graph measur call random shortest path rsp dissimilar depend paramet interest properti reduc end standard shortest path distanc larg end commut time resist distanc small intuit correspond expect cost incur random walker order reach destin node start node maintain constant entropi relat spread graph paramet bias gradual simpl random walk graph shortest path polici adopt statist physic approach comput sum path discret path integr shown rsp dissimilar node node interest comput effici solv linear system equat number node hand dissimilar coupl node obtain invert matrix propos measur graph mine task comput between central find dens commun shown experiment section 